Functional Delaunay Reenement
نویسنده
چکیده
Given a complex of vertices, constraining segments (and planar straight-line constraining facets in 3D) and an-Lipschitz control spacing function f() over the domain, an algorithm presented herein can generate a conforming mesh of Delaunay triangles (tetrahedra in 3D) whose circumradius-to-shortest-edge ratios are no greater than p 2 (2 in 3D). The triangle (tetra-hedron) size is within a constant factor of f(). An implementation in 2D demonstrates that the algorithm generates excellent mesh.
منابع مشابه
A Discussion on Mixed (longest-side Midpoint Insertion) Delaunay Techniques for the Triangulation Reenement Problem
متن کامل
A Delaunay Reenement Algorithm for Quality 2-dimensional Mesh Generation
We present a simple new algorithm for triangulating polygons and planar straightline graphs. It provides \shape" and \size" guarantees: All triangles have a bounded aspect ratio. The number of triangles is within a constant factor of optimal. Such \quality" triangulations are desirable as meshes for the nite element method, in which the running time generally increases with the number of triang...
متن کاملApplications of Automatic Mesh Generation and Adaptive Methods in Computational Medicine
Important problems in Computational Medicine exist that can beneet from the implementation of adaptive mesh reenement techniques. Biological systems are so inherently complex that only eecient models running on state of the art hardware can begin to simulate reality. To tackle the complex geometries associated with medical applications we present a general purpose mesh generation scheme based u...
متن کاملTriangular Element Re nement in Automatic Adaptive Mesh
| A new reenement strategy is proposed for use in an adaptive procedure. The method developed places new nodes in regions of high solution error such that the beneet of the Delaunay re-triangulation algorithm is fully realised. Results show that the improved mesh geometry obtained with this method compared with the conventional centroid approach produces a more eecient mesh, where less nodes ar...
متن کاملAn Automatic Adaptive Reenement and Dereenement Method for 3d Elliptic Problems
We present the theory and implementation for a new automatic adaptive h-re nement and -dere nement method for twoand three-dimensional elliptic problems. An exact lower error bound for dere nement is obtained theoretically in terms of the nite element solution, complementing the various known upper error bounds for re nement. These error bounds are used to determine where to insert and/or remov...
متن کامل